TSTP Solution File: ITP093^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : ITP093^1 : TPTP v8.1.2. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n016.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sat May 4 08:06:56 EDT 2024
% Result : Theorem 0.44s 0.65s
% Output : CNFRefutation 0.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 14
% Syntax : Number of formulae : 23 ( 10 unt; 10 typ; 0 def)
% Number of atoms : 19 ( 0 equ; 0 cnn)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 66 ( 6 ~; 4 |; 0 &; 54 @)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Number of types : 5 ( 4 usr)
% Number of type conns : 8 ( 8 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 12 ( 6 ^ 6 !; 0 ?; 12 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
set_Product_prod_a_a: $tType ).
thf(decl_sort2,type,
set_a: $tType ).
thf(decl_sort3,type,
a: $tType ).
thf(decl_sort4,type,
pair_p125712459t_unit: $tType ).
thf(decl_41,type,
finite179568208od_a_a: set_Product_prod_a_a > $o ).
thf(decl_65,type,
ord_le1824328871od_a_a: set_Product_prod_a_a > set_Product_prod_a_a > $o ).
thf(decl_87,type,
pair_p133601421t_unit: pair_p125712459t_unit > set_Product_prod_a_a ).
thf(decl_92,type,
pair_p1047056820t_unit: pair_p125712459t_unit > set_a ).
thf(decl_107,type,
product_Sigma_a_a: set_a > ( a > set_a ) > set_Product_prod_a_a ).
thf(decl_127,type,
g: pair_p125712459t_unit ).
thf(fact_27_rev__finite__subset,axiom,
! [X37: set_Product_prod_a_a,X38: set_Product_prod_a_a] :
( ( finite179568208od_a_a @ X37 )
=> ( ( ord_le1824328871od_a_a @ X38 @ X37 )
=> ( finite179568208od_a_a @ X38 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.yLYpyAa5K4/E---3.1_26917.p',fact_27_rev__finite__subset) ).
thf(fact_1__092_060open_062parcs_AG_A_092_060subseteq_062_Apverts_AG_A_092_060times_062_Apverts_AG_092_060close_062,axiom,
( ord_le1824328871od_a_a @ ( pair_p133601421t_unit @ g )
@ ( product_Sigma_a_a @ ( pair_p1047056820t_unit @ g )
@ ^ [X1: a] : ( pair_p1047056820t_unit @ g ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.yLYpyAa5K4/E---3.1_26917.p',fact_1__092_060open_062parcs_AG_A_092_060subseteq_062_Apverts_AG_A_092_060times_062_Apverts_AG_092_060close_062) ).
thf(fact_0__092_060open_062finite_A_Ipverts_AG_A_092_060times_062_Apverts_AG_J_092_060close_062,axiom,
( finite179568208od_a_a
@ ( product_Sigma_a_a @ ( pair_p1047056820t_unit @ g )
@ ^ [X1: a] : ( pair_p1047056820t_unit @ g ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.yLYpyAa5K4/E---3.1_26917.p',fact_0__092_060open_062finite_A_Ipverts_AG_A_092_060times_062_Apverts_AG_J_092_060close_062) ).
thf(conj_0,conjecture,
finite179568208od_a_a @ ( pair_p133601421t_unit @ g ),
file('/export/starexec/sandbox2/tmp/tmp.yLYpyAa5K4/E---3.1_26917.p',conj_0) ).
thf(c_0_4,plain,
! [X1410: set_Product_prod_a_a,X1411: set_Product_prod_a_a] :
( ~ ( finite179568208od_a_a @ X1410 )
| ~ ( ord_le1824328871od_a_a @ X1411 @ X1410 )
| ( finite179568208od_a_a @ X1411 ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_27_rev__finite__subset])]) ).
thf(c_0_5,plain,
( ord_le1824328871od_a_a @ ( pair_p133601421t_unit @ g )
@ ( product_Sigma_a_a @ ( pair_p1047056820t_unit @ g )
@ ^ [Z0: a] : ( pair_p1047056820t_unit @ g ) ) ),
inference(fof_simplification,[status(thm)],[fact_1__092_060open_062parcs_AG_A_092_060subseteq_062_Apverts_AG_A_092_060times_062_Apverts_AG_092_060close_062]) ).
thf(c_0_6,plain,
( finite179568208od_a_a
@ ( product_Sigma_a_a @ ( pair_p1047056820t_unit @ g )
@ ^ [Z0: a] : ( pair_p1047056820t_unit @ g ) ) ),
inference(fof_simplification,[status(thm)],[fact_0__092_060open_062finite_A_Ipverts_AG_A_092_060times_062_Apverts_AG_J_092_060close_062]) ).
thf(c_0_7,negated_conjecture,
~ ( finite179568208od_a_a @ ( pair_p133601421t_unit @ g ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])]) ).
thf(c_0_8,plain,
! [X24: set_Product_prod_a_a,X23: set_Product_prod_a_a] :
( ( finite179568208od_a_a @ X24 )
| ~ ( finite179568208od_a_a @ X23 )
| ~ ( ord_le1824328871od_a_a @ X24 @ X23 ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_9,plain,
( ord_le1824328871od_a_a @ ( pair_p133601421t_unit @ g )
@ ( product_Sigma_a_a @ ( pair_p1047056820t_unit @ g )
@ ^ [Z0: a] : ( pair_p1047056820t_unit @ g ) ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_10,plain,
( finite179568208od_a_a
@ ( product_Sigma_a_a @ ( pair_p1047056820t_unit @ g )
@ ^ [Z0: a] : ( pair_p1047056820t_unit @ g ) ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_11,negated_conjecture,
~ ( finite179568208od_a_a @ ( pair_p133601421t_unit @ g ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_12,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10])]),c_0_11]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.18 % Problem : ITP093^1 : TPTP v8.1.2. Released v7.5.0.
% 0.17/0.19 % Command : run_E %s %d THM
% 0.20/0.40 % Computer : n016.cluster.edu
% 0.20/0.40 % Model : x86_64 x86_64
% 0.20/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.40 % Memory : 8042.1875MB
% 0.20/0.40 % OS : Linux 3.10.0-693.el7.x86_64
% 0.20/0.40 % CPULimit : 300
% 0.20/0.40 % WCLimit : 300
% 0.20/0.40 % DateTime : Fri May 3 13:08:31 EDT 2024
% 0.20/0.40 % CPUTime :
% 0.37/0.58 Running higher-order theorem proving
% 0.37/0.58 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.yLYpyAa5K4/E---3.1_26917.p
% 0.44/0.65 # Version: 3.1.0-ho
% 0.44/0.65 # Preprocessing class: HSLMSMSSSSLNSFA.
% 0.44/0.65 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.44/0.65 # Starting new_ho_10 with 1500s (5) cores
% 0.44/0.65 # Starting sh5l with 300s (1) cores
% 0.44/0.65 # Starting new_bool_1 with 300s (1) cores
% 0.44/0.65 # Starting new_bool_2 with 300s (1) cores
% 0.44/0.65 # new_bool_2 with pid 26998 completed with status 0
% 0.44/0.65 # Result found by new_bool_2
% 0.44/0.65 # Preprocessing class: HSLMSMSSSSLNSFA.
% 0.44/0.65 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.44/0.65 # Starting new_ho_10 with 1500s (5) cores
% 0.44/0.65 # Starting sh5l with 300s (1) cores
% 0.44/0.65 # Starting new_bool_1 with 300s (1) cores
% 0.44/0.65 # Starting new_bool_2 with 300s (1) cores
% 0.44/0.65 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.44/0.65 # Search class: HGHSM-FSLM33-DSFFFSBN
% 0.44/0.65 # partial match(1): HGHSM-FSLM33-MSFFFSBN
% 0.44/0.65 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.44/0.65 # Starting new_ho_10 with 163s (1) cores
% 0.44/0.65 # new_ho_10 with pid 26999 completed with status 0
% 0.44/0.65 # Result found by new_ho_10
% 0.44/0.65 # Preprocessing class: HSLMSMSSSSLNSFA.
% 0.44/0.65 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.44/0.65 # Starting new_ho_10 with 1500s (5) cores
% 0.44/0.65 # Starting sh5l with 300s (1) cores
% 0.44/0.65 # Starting new_bool_1 with 300s (1) cores
% 0.44/0.65 # Starting new_bool_2 with 300s (1) cores
% 0.44/0.65 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.44/0.65 # Search class: HGHSM-FSLM33-DSFFFSBN
% 0.44/0.65 # partial match(1): HGHSM-FSLM33-MSFFFSBN
% 0.44/0.65 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.44/0.65 # Starting new_ho_10 with 163s (1) cores
% 0.44/0.65 # Preprocessing time : 0.006 s
% 0.44/0.65 # Presaturation interreduction done
% 0.44/0.65
% 0.44/0.65 # Proof found!
% 0.44/0.65 # SZS status Theorem
% 0.44/0.65 # SZS output start CNFRefutation
% See solution above
% 0.44/0.65 # Parsed axioms : 493
% 0.44/0.65 # Removed by relevancy pruning/SinE : 360
% 0.44/0.65 # Initial clauses : 261
% 0.44/0.65 # Removed in clause preprocessing : 11
% 0.44/0.65 # Initial clauses in saturation : 250
% 0.44/0.65 # Processed clauses : 297
% 0.44/0.65 # ...of these trivial : 11
% 0.44/0.65 # ...subsumed : 89
% 0.44/0.65 # ...remaining for further processing : 197
% 0.44/0.65 # Other redundant clauses eliminated : 49
% 0.44/0.65 # Clauses deleted for lack of memory : 0
% 0.44/0.65 # Backward-subsumed : 0
% 0.44/0.65 # Backward-rewritten : 0
% 0.44/0.65 # Generated clauses : 51
% 0.44/0.65 # ...of the previous two non-redundant : 38
% 0.44/0.65 # ...aggressively subsumed : 0
% 0.44/0.65 # Contextual simplify-reflections : 0
% 0.44/0.65 # Paramodulations : 2
% 0.44/0.65 # Factorizations : 0
% 0.44/0.65 # NegExts : 0
% 0.44/0.65 # Equation resolutions : 49
% 0.44/0.65 # Disequality decompositions : 0
% 0.44/0.65 # Total rewrite steps : 23
% 0.44/0.65 # ...of those cached : 15
% 0.44/0.65 # Propositional unsat checks : 0
% 0.44/0.65 # Propositional check models : 0
% 0.44/0.65 # Propositional check unsatisfiable : 0
% 0.44/0.65 # Propositional clauses : 0
% 0.44/0.65 # Propositional clauses after purity: 0
% 0.44/0.65 # Propositional unsat core size : 0
% 0.44/0.65 # Propositional preprocessing time : 0.000
% 0.44/0.65 # Propositional encoding time : 0.000
% 0.44/0.65 # Propositional solver time : 0.000
% 0.44/0.65 # Success case prop preproc time : 0.000
% 0.44/0.65 # Success case prop encoding time : 0.000
% 0.44/0.65 # Success case prop solver time : 0.000
% 0.44/0.65 # Current number of processed clauses : 9
% 0.44/0.65 # Positive orientable unit clauses : 5
% 0.44/0.65 # Positive unorientable unit clauses: 0
% 0.44/0.65 # Negative unit clauses : 1
% 0.44/0.65 # Non-unit-clauses : 3
% 0.44/0.65 # Current number of unprocessed clauses: 130
% 0.44/0.65 # ...number of literals in the above : 418
% 0.44/0.65 # Current number of archived formulas : 0
% 0.44/0.65 # Current number of archived clauses : 139
% 0.44/0.65 # Clause-clause subsumption calls (NU) : 1799
% 0.44/0.65 # Rec. Clause-clause subsumption calls : 777
% 0.44/0.65 # Non-unit clause-clause subsumptions : 101
% 0.44/0.65 # Unit Clause-clause subsumption calls : 188
% 0.44/0.65 # Rewrite failures with RHS unbound : 0
% 0.44/0.65 # BW rewrite match attempts : 4
% 0.44/0.65 # BW rewrite match successes : 0
% 0.44/0.65 # Condensation attempts : 297
% 0.44/0.65 # Condensation successes : 12
% 0.44/0.65 # Termbank termtop insertions : 30289
% 0.44/0.65 # Search garbage collected termcells : 9106
% 0.44/0.65
% 0.44/0.65 # -------------------------------------------------
% 0.44/0.65 # User time : 0.039 s
% 0.44/0.65 # System time : 0.008 s
% 0.44/0.65 # Total time : 0.046 s
% 0.44/0.65 # Maximum resident set size: 4088 pages
% 0.44/0.65
% 0.44/0.65 # -------------------------------------------------
% 0.44/0.65 # User time : 0.054 s
% 0.44/0.65 # System time : 0.012 s
% 0.44/0.65 # Total time : 0.066 s
% 0.44/0.65 # Maximum resident set size: 3060 pages
% 0.44/0.65 % E---3.1 exiting
% 0.44/0.65 % E exiting
%------------------------------------------------------------------------------